Inequalities characterizing standard Sturmian and episturmian words
نویسنده
چکیده
Considering the smallest and the greatest factorswith respect to the lexicographic orderwe associate to each infinite word r two other infinite words min(r) and max(r). In this paper we prove that the inequalities as min(s) max(s) bs characterize standard Sturmian words (proper ones and periodic ones) and that the condition “for any x ∈ A and lexicographic order< satisfying x=min(A) one has xs min(s)” characterizes standard episturmian words. © 2005 Elsevier B.V. All rights reserved.
منابع مشابه
Sturmian and Episturmian Words (A Survey of Some Recent Results)
This survey paper contains a description of some recent results concerning Sturmian and episturmian words, with particular emphasis on central words. We list fourteen characterizations of central words. We give the characterizations of Sturmian and episturmian words by lexicographic ordering, we show how the Burrows-Wheeler transform behaves on Sturmian words. We mention results on balanced epi...
متن کاملQuasiperiodic and Lyndon episturmian words
Recently the second two authors characterized quasiperiodic Sturmian words, proving that a Sturmian word is non-quasiperiodic if and only if it is an infinite Lyndon word. Here we extend this study to episturmian words (a natural generalization of Sturmian words) by describing all the quasiperiods of an episturmian word, which yields a characterization of quasiperiodic episturmian words in term...
متن کاملPseudopalindrome closure operators in free monoids
We consider involutory antimorphisms θ of a free monoid A∗ and their fixed points, called θ-palindromes or pseudopalindromes. A θ-palindrome reduces to a usual palindrome when θ is the reversal operator. For any word w ∈ A∗ the right (resp. left) θ-palindrome closure of w is the shortest θ-palindrome having w as a prefix (resp. suffix). We prove some results relating θ-palindrome closure operat...
متن کاملCharacterizations of finite and infinite episturmian words via lexicographic orderings
In this paper, we characterize by lexicographic order all finite Sturmian and episturmian words, i.e., all (finite) factors of such infinite words. Consequently, we obtain a characterization of infinite episturmian words in a wide sense (episturmian and episkew infinite words). That is, we characterize the set of all infinite words whose factors are (finite) episturmian. Similarly, we character...
متن کاملPowers in a class of A-strict standard episturmian words
This paper concerns a specific class of strict standard episturmian words whose directive words resemble those of characteristic Sturmian words. In particular, we explicitly determine all integer powers occurring in such infinite words, extending recent results of Damanik and Lenz (2003), who studied powers in Sturmian words. The key tools in our analysis are canonical decompositions and a gene...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 341 شماره
صفحات -
تاریخ انتشار 2005